Recursive Dynamic Programming: Heuristic Rules, Bounding and State Space Reduction
نویسندگان
چکیده
منابع مشابه
Recursive Dynamic Programming: Heuristic Rules, Bounding and State Space Reduction
An alternative approach towards dynamic programming (DP) is presented: Recursions. A basic deterministic model and solution function are defined and the model is generalized to include stochastic processes, with the traditional stochastic DP model as a special case. Heuristic rules are included in the models simply as restrictions on decision spaces and a small slaughter pig marketing planning ...
متن کاملHeuristic Rules , Bounding and State Space Reduction
An alternative approach towards dynamic programming (DP) is presented: Recursions. A basic deterministic model and solution function are defined and the model is generalized to include stochastic processes, with the traditional stochastic DP model as a special case. Heuristic rules are included in the models simply as restrictions on decision spaces and a small slaughter pig marketing planning ...
متن کاملTime Petri Nets State Space Reduction Using Dynamic Programming
In this paper a parametric description for the state space of an arbitrary TPN is given. An enumerative procedure for reducing the state space is introduced. The reduction is defined as a truncated multistage decision problem and solved recursively. A reachability graph is defined in a discrete way by using the reachable integer-states of the TPN.
متن کاملState Space Reduction for Dynamic Process Creation
Automated veri cation of dynamic multi-threaded computing systems is severely a ected by problems relating to dynamic process creation. In this paper, we describe an abstraction technique aimed at generating reduced state space representations for such systems. To make the new technique applicable to a wide range of di erent system models, we express it in terms of general labelled transition s...
متن کاملScheduling as Heuristic Search with State Space Reduction
In this paper we confront the Job Shop Scheduling problem by means of an A* algorithm for heuristic state space searching. This algorithm can guarantee optimal solutions, i.e. it is admissible, under certain conditions, but in this case it requires an amount of memory that grows linearly as the search progresses. We hence start by focusing on techniques that enable us to reduce the size of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC Proceedings Volumes
سال: 1995
ISSN: 1474-6670
DOI: 10.1016/s1474-6670(17)45549-2